#include "sort.h"

#include<iostream>

void test()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	//QuickSortNonR(arr, 0, sz - 1);
	//MergeSort(arr, sz);
	MergeSortNonR(arr, sz);
	for (auto e : arr)
	{
		cout << e << " ";
	}
}

int main()
{
	test();
	return 0;
}